Non-differentiable multiobjective mixed symmetric duality under generalized convexity
نویسندگان
چکیده
منابع مشابه
Non-differentiable multiobjective mixed symmetric duality under generalized convexity
* Correspondence: lijueyou@163. com Department of Mathematics, Chongqing Normal University, Chongqing, 400047, PR China Abstract The objective of this paper is to obtain a mixed symmetric dual model for a class of non-differentiable multiobjective nonlinear programming problems where each of the objective functions contains a pair of support functions. Weak, strong and converse duality theorems...
متن کاملMixed symmetric duality in non-differentiable multiobjective mathematical programming
Two mixed symmetric dual models for a class of non-differentiable multiobjective nonlinear programming problems with multiple arguments are introduced in this paper. These two mixed symmetric dual models unify the four existing multiobjective symmetric dual models in the literature. Weak and strong duality theorems are established for these models under some mild assumptions of generalized conv...
متن کاملMultiobjective Mixed Symmetric Duality with Invexity
The usual duality results are established for mixed symmetric multiobjective dual programs without nonnegativity constraints using the notion of invexity/ generalized invexity which has allowed weakening various types of convexity/ generalized convexity assumptions. This mixed symmetric dual formulation unifies two existing symmetric dual formulations in the literature.
متن کاملMultiobjective Nonlinear Symmetric Duality Involving Generalized Pseudoconvexity
The purpose of this paper is to introduce second order (K, F)-pseudoconvex and second order strongly (K, F)pseudoconvex functions which are a generalization of cone-pseudoconvex and strongly cone-pseudoconvex functions. A pair of second order symmetric dual multiobjective nonlinear programs is formulated by using the considered functions. Furthermore, the weak, strong and converse duality theor...
متن کاملNon-differentiable second order symmetric duality in mathematical programming with F-convexity
A pair of Wolfe type non-differentiable second order symmetric primal and dual problems in mathematical programming is formulated. The weak and strong duality theorems are then established under second order F-convexity assumptions. Symmetric minimax mixed integer primal and dual problems are also investigated. 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2011
ISSN: 1029-242X
DOI: 10.1186/1029-242x-2011-23